Optimal redundancy allocation for high availability routers
نویسندگان
چکیده
How to optimally allocate redundant routers for high availability (HA) networks is a crucial task. In this paper, a 5-tuple availability function A (N ,M, , , ) is proposed to determine the minimum required number of standby routers to meet the desired availability ( ) of an HA router, where N and M are the numbers of active routers and standby routers, respectively, and , , and are a single router’s failure rate, repair rate, and failure detection and recovery rate, respectively. We have derived the availability function, and analytical results show that the failure detection and recovery rate ( ) is a key parameter for reducing the minimum required number of standby routers of an HA router. Thus, we also propose a High Availability Management (HAM) middleware, which was designed based on an open architecture specification, called OpenAIS, to achieve the goal of reducing takeover delay (1/ ) by stateful backup. We have implemented an HA Open Shortest Path First (HA-OSPF) router, which consists of two active routers and one standby router, to illustrate the proposed HA router. Experimental results show that the takeover delays of the proposed HA-OSPF router were reduced by 6, 37.3, and 98.6% compared with those of the industry standard approaches, the Cisco-ASR 1000 series router, the Juniper MX series router, and the Virtual Router Redundancy Protocol (VRRP) router, respectively. In addition, in contract to the industry routers, the proposed HA router, which was designed based on an open architecture specification, is more cost-effective, and its redundancy model can be more flexibly adjusted. Copyright q 2010 John Wiley & Sons, Ltd.
منابع مشابه
Reliability Modelling of the Redundancy Allocation Problem in the Series-parallel Systems and Determining the System Optimal Parameters
Considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. In this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...
متن کاملSolving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method
Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...
متن کاملRedundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies
To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...
متن کاملSimultaneous Allocation Of Reliability & Redundancy Using Minimum Total Cost Of Ownership Approach
This paper addresses the mixed integer reliability redundancy allocation problems to determine simultaneous allocation of optimal reliability and redundancy level of components based on three objective goals. System engineering principles suggest that the best design is the design that maximizes the system operational effectiveness and at the same time minimizes the total cost of ownership (TCO...
متن کاملSolving a Joint Availability-Redundancy Optimization Model with Multi-State Components with Meta-Heuristic
This paper has been worked on a RAP with multi-state components and the performance rate of each component working state may increase by spending technical and organizational activities costs. Whereas RAP belongs to Np-Hard problems, we used Genetic algorithm (GA) and simulated annealing (SA) and for solving the presented problem and calculating system reliability universal generating function ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Communication Systems
دوره 23 شماره
صفحات -
تاریخ انتشار 2010